An Algorithm for Two Dimensional Cutting Stock Problems with Demand
author
Abstract:
In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually considered. The cutting problems belong to the category of Np-hard problems. So finding a desirable solution in a suitable time is practically impossible and heuristic methods must be used. A meta-heuristic algorithm using SA approach is presented.Then attempt will be made to regulate the SAs parameters. Initial solutions are produced with a rule based 
algorithm and two internal and main SAs are used that lead to better performance of the algorithm. Due to lack of benchmark or test problems, two procedures for generating random problems is presented and are used to study efficiency of the algorithm. For this purpose, problems about 10 to 50 types of pieces with maximum demands of 2400 are generated and solved using the proposed algorithm. The results indicate that the algorithm capable of finding a solution with less than 6% of waste for problems with 30 types of pieces and total demands of 500.

similar resources
An ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
full textAn Algorithm for Two-Dimensional Cutting Problems
We present a tree-search algorithm for two-dimensional cutting problems in which there is a constraint on the maximum number of each type of piece that is to be produced. The algorithm limits the size of the tree search by deriving and imposing necessary conditions for the cutting pattern to be optimal. A dynamic programming procedure for the solution of the unconstrained problem and a node eva...
full textan aco algorithm for one-dimensional cutting stock problem
the one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. in this paper a meta-heuristic method based on aco is presented to solve this problem. in this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
full textA Parallel Algorithm for the Two-Dimensional Cutting Stock Problem
Cutting Stock Problems (CSP) arise in many production industries where large stock sheets must be cut into smaller pieces. We present a parallel algorithm based on Viswanathan and Bagchi algorithm (VB) solving the Two-Dimensional Cutting Stock Problem (2DCSP). The algorithm guarantees the processing of best nodes first and does not introduce any redundant combinations others than the already pr...
full textAn integer programming model for two- and three-stage two-dimensional cutting stock problems
In this paper, an integer programming model for two-dimensional cutting stock problems is proposed. In the problems addressed, it is intended to cut a set of small rectangular items of given sizes from a set of larger rectangular plates in such a way that the total number of used plates is minimized. The two-stage and three-stage, exact and non-exact, problems are considered. Other issues are a...
full textMy Resources
Journal title
volume 23 issue 2
pages 59- 76
publication date 2005-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023